Kernel selection with spectral perturbation stability of kernel matrix
نویسندگان
چکیده
منابع مشابه
Efficient Kernel Selection via Spectral Analysis
Kernel selection is a fundamental problem of kernel methods. Existing measures for kernel selection either provide less theoretical guarantee or have high computational complexity. In this paper, we propose a novel kernel selection criterion based on a newly defined spectral measure of a kernel matrix, with sound theoretical foundation and high computational efficiency. We first show that the s...
متن کاملKernel Feature Selection with Side Data Using a Spectral Approach
We address the problem of selecting a subset of the most relevant features from a set of sample data in cases where there are multiple (equally reasonable) solutions. In particular, this topic includes on one hand the introduction of hand-crafted kernels which emphasize certain desirable aspects of the data and, on the other hand, the suppression of one of the solutions given “side” data, i.e.,...
متن کاملKernel Cuts: MRF meets Kernel&Spectral Clustering
The log-likelihood energy term in popular model-fitting segmentation methods, e.g. [64, 14, 50, 20], is presented as a generalized “probabilistic” K-means energy [33] for color space clustering. This interpretation reveals some limitations, e.g. over-fitting. We propose an alternative approach to color clustering using kernel K-means energy with well-known properties such as non-linear separati...
متن کاملSpectral properties of the kernel matrix and their relation to kernel methods in machine learning
This chapter serves as a brief introduction to the supervised learning setting and kernel methods. Moreover, several results from linear algebra, probability theory, and functional analysis are reviewed which will be used throughout the thesis. 2.1 Some notational conventions We begin by introducing some basic notational conventions. The sets N, Z, R, C denote the natural, integer, real, and co...
متن کاملKernel Selection for Semi-Supervised Kernel Machines
Existing semi-supervised learning methods are mostly based on either the cluster assumption or the manifold assumption. In this paper, we propose an integrated regularization framework for semi-supervised kernel machines by incorporating both the cluster assumption and the manifold assumption. Moreover, it supports kernel learning in the form of kernel selection. The optimization problem involv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2014
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-014-5090-z